A note on time hierarchies for reasonable semantic classes without advice
نویسنده
چکیده
We show time hierarchies for reasonable semantic classes without advice by eliminating the constant bits of advice in previous results.The elimination is done by a contrapositive argument that for any reasonable computational model,let CTIME(f(n))/g(n) denote the set of all languages decide by machines running in time O(f(n)) with advice of g(n) bits in that model, if CTIME(t(n)) ⊆ CTIME(T (n))/A(n) then CTIME(t(n))/a ⊆ CTIME(T (n))/a + 2aA(n) where a is a constant integer.
منابع مشابه
The University of Chicago Hierarchy Theorems and Resource Tradeoffs for Semantic Classes a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science By
Computational complexity theory studies the minimum resources (time, space, randomness etc.) to solve computational problems. Two fundamental questions in this area are: 1. Can more problems be solved given more of a given resource? A positive answer to this question is known as a hierarchy theorem. 2. Can one resource be traded off with another when solving a given problem? Such a result is kn...
متن کاملSigact News Complexity Theory Column 52 Bovet and Crescenzi's Complexity Textbook Is Again Available Guest Column: Recent Work on Hierarchies for Semantic Classes
We survey time hierarchies, with an emphasis on recent work on hierarchies for semantic classes.
متن کاملTime Hierarchies: A Survey
We survey time hierarchies, with an emphasis on recent work on hierarchies for semantic classes.
متن کاملA Generic Time Hierarchy for Semantic Models With One Bit of Advice Preliminary version
We show that for any reasonable semantic model of computation and for any positive integer a and rationals 1 ≤ c < d, there exists a language computable in time n with a bits of advice but not in time n with a bits of advice. A semantic model is one for which there exists a computable enumeration that contains all machines in the model but may also contain others. We call such a model reasonabl...
متن کاملOn Heuristic Time Hierarchies Preliminary Version
We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristics algorithms in such syntactic classes as NP and coNP, and also in semantic classes AM and MA. Earlier, Fortnow and Santhanam (FOCS’04) proved the existence of a time hierarchy for heuristics algorithms in BPP. We present an alternative approach and give a simpler proof.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.11158 شماره
صفحات -
تاریخ انتشار 2017